Thesis Proposal: A Logical Foundation for Session-based Concurrent Computation

نویسندگان

  • Bernardo Toninho
  • Robert Harper
  • Stephen Brooks
چکیده

Linear logic has long been heralded for its potential of providing a logical basis for concurrency. While over the years many research attempts were made in this regard, a Curry-Howard correspondence between linear logic and concurrent computation was only found recently, bridging the proof theory of linear logic and session-typed process calculus. Building upon this work, we have developed the theory of intuitionistic linear logic as a logical foundation for session-based concurrency, exploring the logical meanings of several concurrency-theoretic phenomena. I propose to show that intuitionistic linear logic is indeed a suitable logical foundation for message-passing concurrency by going beyond the initial interpretation of propositional linear logic as session types and providing an elegant framework capable of expressing and reasoning about several naturally ocurring phenomena in such a concurrent setting.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inductive and Coinductive Session Types in Higher-Order Concurrent Programs

We develop a theory of inductive and coinductive session types in a computational interpretation of linear logic, enabling the representation of potentially infinite interactions in a compositionally sound way that preserves logical soundness, a major stepping stone towards a full dependent type theory for expressing and reasoning about session-based concurrent higher order distributed programs...

متن کامل

Type safety for substructural specifications: preliminary results

Substructural logics, such as linear logic and ordered logic, have an inherent notion of state and state change. This makes them a natural choice for developing logical frameworks that specify evolving stateful systems. Our previous work has shown that the so-called forward reasoning fragment of ordered linear logic can be used to give clear, concise, and modular specifications of stateful and ...

متن کامل

Proofs, Concurrent Objects, and Computations in a FILL Framework

There are several major approaches to model concurrent computations using logic. In this context, one aim can be to achieve diierent forms of programming as logic, object-oriented or concurrent ones in a same logical language. Linear logic seems to be well-suited to describe computations that are concurrent and based on state transitions. In this paper, we propose and analyze a framework based ...

متن کامل

Intersections and Unions of Session Types

Prior work has extended the deep, logical connection between the linear sequent calculus and sessiontyped message-passing concurrent computation with equi-recursive types and a natural notion of subtyping. In this paper, we extend this further by intersection and union types in order to express multiple behavioral properties of processes in a single type. We prove session fidelity and absence o...

متن کامل

Dependently Typed Programming with Domain-Specific Logics (Thesis Proposal DRAFT)

We propose a thesis defending the following statement: The logical notions of polarity and focusing provide a foundation for dependently typed programming with domain-specific logics, with applications to certified software and mechanized metatheory.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014